Computing distances between partial rankings
نویسندگان
چکیده
We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(n log n/ log log n) time, and the second in O(n log min{b, c}) time.
منابع مشابه
Clustering and Prediction of Rankings Within a Kemeny Distance Framework
Rankings and partial rankings are ubiquitous in data analysis, yet there is relatively little work in the classification community that uses the typical properties of rankings. We review the broader literature that we are aware of, and identify a common building block for both prediction of rankings and clustering of rankings, which is also valid for partial rankings. This building block is the...
متن کاملAn efficient approach for the rank aggregation problem
This paper presents some computational properties of the Rank-Distance, a measure of similarity between partial rankings. We show how this distance generalizes the Spearman footrule distance, preserving its good computational complexity: the Rank-Distance between two partial rankings can be computed in linear time, and the rank aggregation problem can be solved in polynomial time. Further, we p...
متن کاملOn sets of OT rankings
4 Partial rankings 11 4.1 Logic for partial rankings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2 Entailment between partial rankings . . . . . . . . . . . . . . . . . . . . . . . . 22 4.3 Correspondence between partial rankings and tableaux . . . . . . . . . . . . . 24 4.4 Duality between partial rankings and sets of tableaux . . . . . . . . . . . . . . 27 4.5 The domai...
متن کاملRanking with Kernels in Fourier space
In typical ranking problems the total number n of items to be ranked is relatively large, but each data instance involves only k << n items. This paper examines the structure of such partial rankings in Fourier space. Specifically, we develop a kernel–based framework for solving ranking problems, define some canonical kernels on permutations, and show that by transforming to Fourier space, the ...
متن کاملStatistical Uses for Distances between Permutations
We present examples of cases where rankings are the natural output of multivariate rank reduction methods. For political data without including prior information about members position on the left -right spectrum we can use voting records to provide the underlying gradient. Ordination methods are the standard procedure for summarizing in archaelogy, psychometrics or ecology, where underlying gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009